Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
نویسندگان
چکیده
منابع مشابه
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
A d-graph G = (V ;E1, . . . , Ed) is a complete graph whose edges are colored by d colors, or in other words, are partitioned into d subsets (some of which might be empty). We say that G is complementary connected if the complement to each chromatic component of G is connected on V , or in other words, if for each two vertices u,w ∈ V and color i ∈ I = {1, . . . , d} there is a path between u a...
متن کاملDecomposing complete edge-chromatic graphs and hypergraphs
A d-graph G = (V ;E1, . . . , Ed) is a complete graph whose edges are colored by d colors, or in other words, are partitioned into d subsets (some of which might be empty). We say that G is complementary connected if the complement to each chromatic component of G is connected on V , or in other words, if for each two vertices u, w ∈ V and color i ∈ I = {1, . . . , d} there is a path between u ...
متن کاملComplete Subgraphs of Chromatic Graphs and Hypergraphs
In this note we consider k-chromatic graphs with given colour k r-graphs have vertex sets u C i , and no r-tuple (i .e. edge o f 1 the r-graph) has two vertices in the same colour class C i .
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملStrong total chromatic numbers of complete hypergraphs
We determine the strong total chromatic number of the complete h-uniform hypergraph Kh, and the complete h-partite hypergraph K,
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.06.026